Evolutionarily stable strategies of random games, and the vertices of random polygons
نویسندگان
چکیده
منابع مشابه
Evolutionarily Stable Strategies of Random Games, and the Vertices of Random Polygons∗
An evolutionarily stable strategy (ESS) is an equilibrium strategy that is immune to invasions by rare alternative (“mutant”) strategies. Unlike Nash equilibria, ESS do not always exist in finite games. In this paper we address the question of what happens when the size of the game increases: does an ESS exist for “almost every large” game? Letting the entries in the n × n game matrix be indepe...
متن کاملEvolutionarily Stable Strategies of Random Games, and the Vertices of Random Polygons1 by Sergiu Hart,
An evolutionarily stable strategy (ESS) is an equilibrium strategy that is immune to invasions by rare alternative (“mutant”) strategies. Unlike Nash equilibria, ESS do not always exist in finite games. In this paper we address the question of what happens when the size of the game increases: does an ESS exist for “almost every large” game? Letting the entries in the n × n game matrix be indepe...
متن کاملCounting Stable Strategies in Random Evolutionary Games
In this paper we study the notion of the Evolutionary Stable Strategies (ESS) in evolutionary games and we demonstrate their qualitative difference from the Nash Equilibria, by showing that a random evolutionary game has on average exponentially less number of ESS than the number of Nash Equilibria in the underlying symmetric 2-person game with random payoffs.
متن کاملthe effect of explicit teaching of metacognitive vocabulary learning strategies on recall and retention of idioms
چکیده ندارد.
15 صفحه اولGenerating Random Polygons with Given Vertices
The problem of generating \random" geometric objects is motivated by the need to generate test instances for geometric algorithms. We examine the speciic problem of generating a random x-monotone polygon on a given set of n vertices. Here, \random" is taken to mean that we select uniformly at random a polygon, from among all those x-monotone polygons having the given n vertices. We give an algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2008
ISSN: 1050-5164
DOI: 10.1214/07-aap455